Offline eller online bhakti: Fra mediering til medialisering?
نویسندگان
چکیده
منابع مشابه
Offline to Online Conversion
We consider the problem of converting offline estimators into an online predictor or estimator with small extra regret. Formally this is the problem of merging a collection of probability measures over strings of length 1,2,3,... into a single probability measure over infinite sequences. We describe various approaches and their pros and cons on various examples. As a side-result we give an elem...
متن کاملOnline Appendix: Ideological Segregation Online and Offline
In table 2 we present standard errors for our main estimates. For estimates that come from MRI, the GSS or the CNES, we compute standard errors through a nonparametric bootstrap over samples of respondents. For estimates that come from comScore aggregate data, that is not an option. Instead we perform a parametric bootstrap in which we model the share conservative of each website as an independ...
متن کاملImproved Online/Offline Signature Schemes
The notion of on-line/off-line signature schemes was introduced in 1990 by Even, Goldreich and Micali. They presented a general method for converting any signature scheme into an on-line/off-line signature scheme, but their method is not very practical as it increases the length of each signature by a quadratic factor. In this paper we use the recently introduced notion of a trapdoor hash funct...
متن کاملOnline/Offline Attribute-Based Encryption
Attribute-based encryption (ABE) is a type of public key encryption that allows users to encrypt and decrypt messages based on user attributes. For instance, one can encrypt a message to any user satisfying the boolean formula (“crypto conference attendee” AND “PhD student”) OR “IACR member”. One drawback is that encryption and key generation computational costs scale with the complexity of the...
متن کاملEfficient Online/Offline Signcryption Scheme
In this paper, we propose a new signcryption scheme and its online/offline version from pairings. Based on the assumption of k+1 square roots, the scheme is proven, without random oracles, to be secure against the existential forgery under an adaptive chosen-message attack. It is also proven that its IND-CPA security also implies its IND-CCA2 security. A comparison is made with existing schemes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Religionsvidenskabeligt Tidsskrift
سال: 2020
ISSN: 1904-8181,0108-1993
DOI: 10.7146/rt.v0i70.120601